Exact and Approximation Algorithms for Clustering (Extended Abstract)
نویسندگان
چکیده
In this paper we present an n O(k 1?1=d) time algorithm for solving the k-center problem in R d , under L1 and L2 met-rics. The algorithm extends to other metrics, and to the discrete k-center problem. We also describe a simple (1+)-approximation algorithm for the k-center problem, with running time O(n log k) + (k==) O(k 1?1=d). Finally, we present a n O(k 1?1=d) time algorithm for solving the L-capacitated k-center problem, provided that L = (n=k 1?1=d) or L = O(1). We conclude with a simple approximation algorithm for the L-capacitated k-center problem.
منابع مشابه
Exact algorithms for solving a bi-level location–allocation problem considering customer preferences
The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملEstimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study
One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملGeneralizing k-means for an arbitrary distance matrix
The original k-means clustering method works only if the exact vectors representing the data points are known. Therefore calculating the distances from the centroids needs vector operations, since the average of abstract data points is undefined. Existing algorithms can be extended for those cases when the sole input is the distance matrix, and the exact representing vectors are unknown. This e...
متن کامل